Multiple Ant Colony Optimization Based on Pearson Correlation Coefficient
نویسندگان
چکیده
منابع مشابه
Event Space-Correlation Analysis Algorithm Based on Ant Colony Optimization
Historical disaster events are taken as a case for space-correlation analysis, three-dimensional disasters space-time network are modeled and chain relationship of disaster nodes are mined by looking for similar space vector in network. Then transformed the vector discover problem into a path optimization problem and solved by using ant colony algorithm, where the pheromone parameter in the pro...
متن کاملpharmACOphore: multiple flexible ligand alignment based on ant colony optimization
The flexible superimposition of biologically active ligands is a crucial step in ligand-based drug design. Here we present pharmACOphore, a new approach for pairwise as well as multiple flexible alignment of ligands based on ant colony optimization (ACO; Dorigo, M.; Stützle, T. Ant Colony Optimization; MIT Press: Cambridge, MA, USA, 2004). An empirical scoring function is used, which describes ...
متن کاملAnt Colony Optimization and Multiple
The ant colony optimization algorithms and their applications on the multiple knapsack problem (MKP) are introduced. The MKP is a hard combinatorial optimization problem with wide application. Problems from different industrial fields can be interpreted as a knapsack problem including financial and other management. The MKP is represented by a graph, and solutions are represented by paths throu...
متن کاملA new consensus measure based on Pearson correlation coefficient
Obtaining consensual solutions is an important issue in decision making processes. It depends on several factors such as experts’ opinions, principles, knowledge, experience, etc. In the literature we can find a considerable amount of consensus measurement from different research areas (from a Social Choice perspective: Alcalde-Unzu and Vorsatz [1], Alcantud, de Andrés Calle and Cascón [2] and ...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2915673